(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → b(b(c(a(x1))))
b(c(c(x1))) → c(a(x1))
Rewrite Strategy: INNERMOST
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
A(b(z0)) → c2(B(b(c(a(z0)))), B(c(a(z0))), A(z0))
B(c(c(z0))) → c3(A(z0))
S tuples:
A(b(z0)) → c2(B(b(c(a(z0)))), B(c(a(z0))), A(z0))
B(c(c(z0))) → c3(A(z0))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
A, B
Compound Symbols:
c2, c3
(3) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)
Use narrowing to replace
A(
b(
z0)) →
c2(
B(
b(
c(
a(
z0)))),
B(
c(
a(
z0))),
A(
z0)) by
A(b(z0)) → c2(B(b(c(z0))), B(c(a(z0))), A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
B(c(c(z0))) → c3(A(z0))
A(b(z0)) → c2(B(b(c(z0))), B(c(a(z0))), A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
S tuples:
B(c(c(z0))) → c3(A(z0))
A(b(z0)) → c2(B(b(c(z0))), B(c(a(z0))), A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
B, A
Compound Symbols:
c3, c2
(5) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)
Use narrowing to replace
A(
b(
z0)) →
c2(
B(
b(
c(
z0))),
B(
c(
a(
z0))),
A(
z0)) by
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))), A(c(z0)))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
B(c(c(z0))) → c3(A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))), A(c(z0)))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
S tuples:
B(c(c(z0))) → c3(A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))), A(c(z0)))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
B, A
Compound Symbols:
c3, c2, c2
(7) CdtGraphRemoveTrailingProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing tuple parts
(8) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
B(c(c(z0))) → c3(A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))))
S tuples:
B(c(c(z0))) → c3(A(z0))
A(b(b(z0))) → c2(B(b(c(b(b(c(a(z0))))))), B(c(a(b(z0)))), A(b(z0)))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
B, A
Compound Symbols:
c3, c2, c2
(9) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)
Use narrowing to replace
A(
b(
b(
z0))) →
c2(
B(
b(
c(
b(
b(
c(
a(
z0))))))),
B(
c(
a(
b(
z0)))),
A(
b(
z0))) by
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
(10) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
B(c(c(z0))) → c3(A(z0))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
S tuples:
B(c(c(z0))) → c3(A(z0))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0)))))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
B, A
Compound Symbols:
c3, c2, c2, c2
(11) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)
Used rewriting to replace A(b(c(z0))) → c2(B(c(a(z0))), B(c(a(c(z0))))) by A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
(12) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
B(c(c(z0))) → c3(A(z0))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
S tuples:
B(c(c(z0))) → c3(A(z0))
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
B, A
Compound Symbols:
c3, c2, c2, c2
(13) CdtForwardInstantiationProof (BOTH BOUNDS(ID, ID) transformation)
Use forward instantiation to replace
B(
c(
c(
z0))) →
c3(
A(
z0)) by
B(c(c(b(y0)))) → c3(A(b(y0)))
B(c(c(b(b(y0))))) → c3(A(b(b(y0))))
B(c(c(b(b(b(y0)))))) → c3(A(b(b(b(y0)))))
B(c(c(b(c(y0))))) → c3(A(b(c(y0))))
(14) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
B(c(c(b(y0)))) → c3(A(b(y0)))
B(c(c(b(b(y0))))) → c3(A(b(b(y0))))
B(c(c(b(b(b(y0)))))) → c3(A(b(b(b(y0)))))
B(c(c(b(c(y0))))) → c3(A(b(c(y0))))
S tuples:
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
B(c(c(b(y0)))) → c3(A(b(y0)))
B(c(c(b(b(y0))))) → c3(A(b(b(y0))))
B(c(c(b(b(b(y0)))))) → c3(A(b(b(b(y0)))))
B(c(c(b(c(y0))))) → c3(A(b(c(y0))))
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:
A, B
Compound Symbols:
c2, c2, c2, c3
(15) CdtUnreachableProof (EQUIVALENT transformation)
The following tuples could be removed as they are not reachable from basic start terms:
A(b(x0)) → c2(B(c(a(x0))), A(x0))
A(b(b(z0))) → c2(B(b(c(b(b(c(z0)))))), B(c(a(b(z0)))), A(b(z0)))
A(b(b(b(z0)))) → c2(B(b(c(b(b(c(b(b(c(a(z0)))))))))), B(c(a(b(b(z0))))), A(b(b(z0))))
A(b(b(x0))) → c2(B(c(a(b(x0)))))
A(b(c(z0))) → c2(B(c(a(z0))), B(c(c(z0))))
B(c(c(b(y0)))) → c3(A(b(y0)))
B(c(c(b(b(y0))))) → c3(A(b(b(y0))))
B(c(c(b(b(b(y0)))))) → c3(A(b(b(b(y0)))))
B(c(c(b(c(y0))))) → c3(A(b(c(y0))))
(16) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(z0) → z0
a(b(z0)) → b(b(c(a(z0))))
b(c(c(z0))) → c(a(z0))
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
a, b
Defined Pair Symbols:none
Compound Symbols:none
(17) SIsEmptyProof (EQUIVALENT transformation)
The set S is empty
(18) BOUNDS(O(1), O(1))